Boosting Partial Symmetry Breaking by Local Search
نویسندگان
چکیده
S. D. Prestwich, B. Hnich, H. Simonis, R. Rossi, and S. A. Tarim Cork Constraint Computation Centre, University College Cork, Ireland Faculty of Computer Science, Izmir University of Economics, Turkey Logistics, Decision and Information Sciences Group, Wageningen UR, the Netherlands Operations Management Division, Nottingham University Business School, Nottingham, UK [email protected], [email protected], [email protected], [email protected], [email protected]
منابع مشابه
Symmetry Breaking by Local Search
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search effort, and several methods for breaking symmetries have been reported. We describe a new approach to partial symmetry breaking: using local search in the symmetry group to detect violated lex-leader constraints. The local search is interleaved with the backtrack search performed by the constrai...
متن کاملSymmetry Breaking by Nonstationary Optimisation
We describe a new partial symmetry breaking method that can be used to break arbitrary variable/value symmetries in combination with depth first search, static value ordering and dynamic variable ordering. The main novelty of the method is a new dominance detection technique based on local search in the symmetry group. It has very low time and memory requirements, yet in preliminary experiments...
متن کاملBoosting SBDS for Partial Symmetry Breaking in Constraint Programming
The paper proposes a dynamic method, Recursive SBDS (ReSBDS), for efficient partial symmetry breaking. We first demonstrate how (partial) Symmetry Breaking During Search (SBDS) misses important pruning opportunities when given only a subset of symmetries to break. The investigation pinpoints the culprit and in turn suggests rectification. The main idea is to add extra conditional constraints du...
متن کاملSupersymmetric Modeling for Local Search
A previous paper showed that adding binary symmetry breaking constraints to a model can degrade local search performance. This paper shows that even unary constraints are not necessarily beneficial because they can transform solutions into local minima. Furthermore, performance can be improved by the reverse of symmetry breaking: using a supersymmetric model with extra symmetry. Some improved r...
متن کاملNegative Effects of Modeling Techniques on Search Performance
Symmetries occur in many combinatorial problems, and a great deal of research has been done on symmetry breaking techniques for backtrack search. However, few results have been reported on the use of symmetry breaking with local search. On four classes of problem we find that adding symmetry breaking constraints to a model impairs local search performance, in terms of both execution time and se...
متن کامل